Efficient algorithms to globally balance a binary search tree

Connecting Yule Process, Bisection and Binary Search Tree via Martingales

We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.

Designing Optimal Binary Search Tree Using Parallel Genetic Algorithms

Evolutionary algorithms (EAs) are modern techniques for searching complex spaces for on optimum [11]. Genetic algorithms (GAs) are developed as random search methods, which have not so sensitivity on primary data of the problems. They can be used in estimation of system parameters in order to obtain the best result. This can be achieved by optimization of an objective function. Genetic programm...

Variable KD-Tree Algorithms for Efficient Spatial Pattern Search

In this paper we consider the problem of finding sets of points that conform to a given underlying model from within a dense, noisy set of observations. This problem is motivated by the task of efficiently linking faint asteroid detections, but is applicable to a range of spatial queries. We survey current tree-based approaches, showing a tradeoff exists between single tree and multiple tree al...

A Randomized Self-Adjusting Binary Search Tree

We present algorithms for a new self-adjusting binary search tree, which we call a shuffle tree. The tree is easy to implement and does not require parent pointers or balancing information to be stored in tree nodes. A maximum of one rotation is probabilistically applied during each traversal, which keeps the cost of balancing activity low. We present tests to compare the performance of shuffle...

A New Weight Balanced Binary Search Tree